Very large - scale neighborhood search : Theory , algorithms and applications
نویسندگان
چکیده
A combinatorial optimization problem (COP) P consists of a collection of its instances. An instance of P can be represented as an ordered pair (F, f), where F is the family of feasible solutions and f is the objective function which is used to compare two feasible solutions. The family F is formed by subsets of a finite set E = {1, 2, ..., m} called the ground set. The objective function f :F→ Q ∪ 0 { } assigns a
منابع مشابه
Two new heuristic algorithms for Covering Tour Problem
Covering Tour Problem (CTP) is the generalized form of Traveling Salesman Problem (TSP), which has found different applications in the designing of distribution networks, disaster relief, and transportation routing. The purpose of this problem is to determine the Hamiltoniancyclewiththe lowest costusinga subset of all the nodes, such that the other nodes would be in a distance shorter than the ...
متن کاملA survey of very large-scale neighborhood search techniques
Many optimization problems of practical interest are computationally intractable. Therefore, a practical approach for solving such problems is to employ heuristic (approximation) algorithms that can find nearly optimal solutions within a reasonable amount of computation time. An improvement algorithm generally starts with a feasible solution and iteratively tries to obtain a better solution. Ne...
متن کاملCreating Very Large Scale Neighborhoods out of Smaller Ones by Compounding Moves: a Study on the Vehicle Routing Problem
Neighborhood search algorithms are a wide class of improvement algorithms where at each iteration an improving solution is found by searching the “neighborhood” of the current solution. This paper discusses neighborhood search algorithms where the size of the neighborhood is “very large” with respect to the size of the input data. For large problem instances, it is impractical to search these n...
متن کاملVery Large-Scale Neighborhood Search: Overview and Case Studies on Coloring Problems
Two key issues in local search algorithms are the definition of a neighborhood and the way to examine it. In this chapter we consider techniques for examining very large neighborhoods, in particular, ways for exactly searching them. We first illustrate such techniques using three paradigmatic examples. In the largest part of the chapter, we focus on the development and experimental study of ver...
متن کاملVery Large-Scale Neighborhood Search Techniques in Timetabling Problems
We describe the use of very large-scale neighborhood search (VLSN) techniques in examination timetabling problems. We detail three applications of VLSN algorithms that illustrate the versatility and potential of such algorithms in timetabling. The first of these uses cyclic exchange neighborhoods, in which an ordered subset of exams in disjoint time slots are swapped cyclically such that each e...
متن کاملVery Large-Scale Neighborhood Search
Neighborhood search algorithms are often the most effective approaches available for solving partitioning problems, a difficult class of combinatorial optimization problems arising in many application domains including vehicle routing, telecommunications network design, parallel machine scheduling, location theory, and clustering. A critical issue in the design of a neighborhood search algorith...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2004